Weak Clarke epiderivative in set-valued optimization
نویسندگان
چکیده
منابع مشابه
Weak Sharp Minima in Set-Valued Optimization Problems
and Applied Analysis 3 x0, y0 ∈ L StrD F, S resp., x0, y0 ∈ LW MinD F, S , if there exists a neighborhood U of x0 in X such that y0 ∈ StrD F U ∩ S ( resp., y0 ∈ W minD F U ∩ S ) , that is, ∀x ∈ S∩U, F x − y0 ∩ −D\{0} ∅ resp. ∀x ∈ S∩U, F x − y0 ∩ − intD ∅. 2.4 We will say that x0, y0 is a global strict global weak minimizers when U X. The set of all global strict minimizers resp., weak minimizer...
متن کاملCharacterization of weak fixed point property for new class of set-valued nonexpansive mappings
In this paper, we introduce a new class of set-valued mappings which is called MD-type mappings. This class of mappings is a set-valued case of a class of the D-type mappings. The class of D-type mappings is a generalization of nonexpansive mappings that recently introduced by Kaewkhao and Sokhuma. The class of MD-type mappings includes upper semi-continuous Suzuki type mappings, upper semi-con...
متن کاملHigher-Order Weakly Generalized Adjacent Epiderivatives and Applications to Duality of Set-Valued Optimization
A new notion of higher-order weakly generalized adjacent epiderivative for a set-valued map is introduced. By virtue of the epiderivative and weak minimality, a higher-order Mond-Weir type dual problem and a higher-order Wolfe type dual problem are introduced for a constrained setvalued optimization problem, respectively. Then, corresponding weak duality, strong duality and converse duality the...
متن کاملGlobal and local optimality conditions in set-valued optimization problems
Through the paper, X and Y are normed vector spaces; however, most of the results remain true in the more general setting of locally convex spaces. We denote by X∗ and Y∗ the topological dual spaces of X and Y . We consider a pointed closed convex cone Q ⊂ Y which introduces a partial order on Y by the equivalence y1 ≤Q y2 ⇔ y2 − y1 ∈Q; we also suppose, in general, that Q has nonempty interior....
متن کاملFirst-order optimality conditions in set-valued optimization
A a set-valued optimization problem minC F (x), x ∈ X0, is considered, where X0 ⊂ X , X and Y are Banach spaces, F : X0 Y is a set-valued function and C ⊂ Y is a closed cone. The solutions of the set-valued problem are defined as pairs (x, y), y ∈ F (x), and are called minimizers. In particular the notions ofw-minimizer (weakly efficient points), p-minimizer (properly efficient points) and i-mi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 2008
ISSN: 0022-247X
DOI: 10.1016/j.jmaa.2007.11.057